A Fully Reversible Asymptotically Zero Energy Microprocessor
نویسندگان
چکیده
Reversibility is the only way to compute with asymptotically zero power, and is a novel approach to low power, low energy computing. Recent implementations of reversible and adi-abatic 15, 7] logic in standard cmos silicon processes have motivated further research into reversible computing. The application of reversible computing techniques to reduce energy dissipation of current generation cmos circuits has so far been found to be limited, but the techniques used to design reversible computers are interesting in and of themselves, and other technologies, such as Josephson Junctions and quantum computers as well as future cmos technologies , may require fully reversible logic. This paper discusses the design of a fully reversible microprocessor architecture. Computing with reversible logic is the only way to avoid dissipating the energy associated with bit erasure. Low energy techniques such as voltage scaling lower the cost of erasing information. Techniques such as clock gating eeectively reduce the number of bits erased. Reversible techniques have already been used to lower the cost of bit erasure for nodes that have a high cost of erasure, but this work is directed at saving every bit, computing fully reversibly. The goal is to convert a conventional risc processor to completely reversible operation. This investigation indicates where bit erasure happens in a conventional machine and the varying diiculty across datapath modules of computing without erasing bits. The initial motivation for reversible computing research came from an investigation of fundamental limits of energy dissipation during computation 8]. The link between entropy in the information science sense and entropy in the thermodynamics sense, exhibited by Maxwell's demon 9], requires a minimum energy dissipation of k B T ln 2, where k B is Boltzmann's constant , when a bit is erased. Erasing a bit is a logically irreversible operation with a physically irreversible eeect. A reversible computer avoids bit erasure. Judicious application of reversibility in adiabatic circuits has already proven its usefulness in reducing energy dissipation 2]. This paper examines the complexity and diiculty in avoiding bit erasure entirely and discusses a set of techniques for designing reversible systems.
منابع مشابه
Reversible computer engineering and architecture
There exists a set of reversible primitive modules that may be combined according to a set of simple rules to create larger systems, which are themselves reversible primitive modules. These modules may be combined to create a fully reversible, universal computer. I describe techniques for creating reversible primitive modules from simple switches, such as conventional CMOS transistors, and the ...
متن کاملReversibility for efficient computing
Today’s computers are based on irreversible logic devices, which have been known to be fundamentally energy-inefficient for several decades. Recently, alternative reversible logic technologies have improved rapidly, and are now becoming practical. In traditional models of computation, pure reversibility seems to decrease overall computational efficiency; I provide a proof to this effect. Howeve...
متن کاملOn zero divisor graph of unique product monoid rings over Noetherian reversible ring
Let $R$ be an associative ring with identity and $Z^*(R)$ be its set of non-zero zero divisors. The zero-divisor graph of $R$, denoted by $Gamma(R)$, is the graph whose vertices are the non-zero zero-divisors of $R$, and two distinct vertices $r$ and $s$ are adjacent if and only if $rs=0$ or $sr=0$. In this paper, we bring some results about undirected zero-divisor graph of a monoid ring o...
متن کاملStrain: A Secure Auction for Blockchains
We present Strain, a new auction protocol running on top of blockchains and guaranteeing bid confidentiality against fully-malicious parties. As our goal is efficiency and low blockchain latency, we abstain from using traditional, highly interactive MPC primitives such as secret shares. Instead for Strain, we design a new maliciouslysecure two-party comparison mechanism executed between any pai...
متن کاملOn quasi-zero divisor graphs of non-commutative rings
Let $R$ be an associative ring with identity. A ring $R$ is called reversible if $ab=0$, then $ba=0$ for $a,bin R$. The quasi-zero-divisor graph of $R$, denoted by $Gamma^*(R)$ is an undirected graph with all nonzero zero-divisors of $R$ as vertex set and two distinct vertices $x$ and $y$ are adjacent if and only if there exists $0neq rin R setminus (mathrm{ann}(x) cup mathrm{ann}(y))$ such tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998